A Class of secure Double Length Hash Functions
نویسنده
چکیده
In this paper we constructed a class of double length hash functions which are maximally secure i.e. the birthday attack is the best possible attack. Recently, Joux [6] in Crypto-04 showed a multicollision attack on the classical iterated hash function which can be used to get the collision on the concatenated double length hash functions. Very recently, Lucks [10] also designed a double-pipe hash which is secure against any multicollision attack and Hirose [5] designed a double block length collision resistance hash functions which are based on a secure block-cipher. Here, we study closely to their papers [5], [10] and constructed a class of secure double length hash functions.
منابع مشابه
On the Design of Secure and Fast Double Block Length Hash Functions
In this work the security of the rate-1 double block length hash functions, which based on a block cipher with a block length of n-bit and a key length of 2n-bit, is reconsidered. Counter-examples and new attacks are presented on this general class of double block length hash functions with rate 1, which disclose uncovered flaws in the necessary conditions given by Satoh et al. and Hirose. Prei...
متن کاملDesigns of Efficient Secure Large Hash Values
A double length hash function is a 2n-bit hash function based on an n-bit compression function. To increase the security level, designs of good double length hash functions are important. In this paper we construct a class of maximally secure double length hash functions in random oracle model based on some good permutations. This class contains recently proposed double length hash functions [1...
متن کاملTowards Optimal Double-Length Hash Functions
In this paper we design several double length hash functions and study their security properties in the random oracle model. We design a class of double length hash functions (and compression functions) which includes some recent constructions [4, 6, 10]. We also propose a secure double length hash function which is as efficient as the insecure concatenated classical hash functions [7].
متن کاملMore Insights on Blockcipher-Based Hash Functions
In this paper we give more insights on the security of blockcipherbased hash functions. We give a very simple criterion to build a secure large class of Single-Block-Length (SBL) or double call DoubleBlock-Length (DBL) compression functions based on (kn, n) blockciphers, where kn is the key length and n is the block length and k is an integer. This criterion is simpler than previous works in th...
متن کاملSecurity of Iterated Hash Functions Based on Block Ciphers
Cryptographic hash functions obtained by iterating a round function constructed from a block cipher and for which the hash-code length is twice the block length m of the underlying block cipher are considered. The computational security of such hash functions against two particular attacks, namely, the free-start target and free-start collision attacks, is investigated; these two attacks differ...
متن کامل